HardwareBoftware Partitioning with Iterative Improvement Heuristics
نویسندگان
چکیده
The paper presents two heuristics for hardwarelsoftware partitioning of system level spec@cations. The main objective is to achieve pedormance optimization with a limited hardware and software cost. We consider minimization of communication cost and improvement of the overall parallelism as essential criteria. One ofthe heuristics is based on simulated annealing and the other on tabu search. Experiments show the superiority of the tabu search based algorithm.
منابع مشابه
Performance Guided System Level Hardware/Software Partitioning with Iterative Improvement Heuristics
This paper presents two heuristics for automatic hardware/software partitioning of system level specifications. Partitioning is performed at the granularity of loops, subprograms, and processes with the objective of performance optimization with a limited hardware and software cost. We define the metric values for partitioning and develop a cost function that guides partitioning towards the des...
متن کاملSimulated Annealing Approach onto VLSI Circuit Partitioning
Decompositions of inter-connected components, to achieve modular independence, poses the major problem in VLSI circuit partitioning. This problem is intractable in nature, Solutions of these problem in computational science is possible through appropriate heuristics. Reduction of cost that occurs due to interconnectivity between several VLSI components is referred in this paper. Modification of...
متن کاملIterative Partitioning with Varying Node Weights
The balanced partitioning problem divides the nodes of a [hyper]graph into groups of approximately equal weight (i.e., satisfying balance constraints) while minimizing the number of [hyper]edges that are cut (i.e., adjacent to nodes in di erent groups). Classic iterative algorithms use the pass paradigm [24] in performing single-node moves [16, 13] to improve the initial solution. To satisfy pa...
متن کاملIterative-improvement-based declustering heuristics for multi-disk databases
Data declustering is an important issue for reducing query response times in multi-disk database systems. In this paper, we propose a declustering method that utilizes the available information on query distribution, data distribution, data-item sizes, and disk capacity constraints. The proposed method exploits the natural correspondence between a data set with a given query distribution and a ...
متن کاملStandard Cell Placement using Iterative & Constructive Heuristics for Multi-Objective Optimization
Focus in the present rests on optimization of multi-objective standard cell placement for maximizing the speed and minimizing power and interconnect wire-length with cell-width as a constraint. It incorporates fuzzy cost function rules for designing of multi-objectives to integrate the cost of above defined objectives. A significant improvement is reported when the iterative-constructive standa...
متن کامل